*****************************************************************************
                     Task identifier - 0000_to_00000.EEEE13
*****************************************************************************
> Start of solving the task "0000_to_00000.EEEE13":  15:53:56 (time), 12.08.2018 (date).
-----------------------------------------------------------------------------
1. It is the end of a stage to enter the task input data.
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 1/12 TP with numbers 1 and 3), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 1/12 TP with numbers 1 and 3).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 30. Minimum losses from servicing by the transport vehicle 2 of target points - 35,54 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 1/12 TP with numbers 1 and 3).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 2/12 TP with numbers 1 and 4), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 2/12 TP with numbers 1 and 4).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 25. Minimum losses from servicing by the transport vehicle 2 of target points - 23,69 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 2/12 TP with numbers 1 and 4).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 3/12 TP with numbers 1 and 5), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 3/12 TP with numbers 1 and 5).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 25. Minimum losses from servicing by the transport vehicle 2 of target points - 20,06 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 3/12 TP with numbers 1 and 5).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 4/12 TP with numbers 2 and 1), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 4/12 TP with numbers 2 and 1).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 35. Minimum losses from servicing by the transport vehicle 2 of target points - 31,60 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 4/12 TP with numbers 2 and 1).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 5/12 TP with numbers 2 and 3), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 5/12 TP with numbers 2 and 3).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 30. Minimum losses from servicing by the transport vehicle 2 of target points - 35,31 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 5/12 TP with numbers 2 and 3).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 6/12 TP with numbers 2 and 4), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 6/12 TP with numbers 2 and 4).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 25. Minimum losses from servicing by the transport vehicle 2 of target points - 23,46 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 6/12 TP with numbers 2 and 4).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 7/12 TP with numbers 3 and 1), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 7/12 TP with numbers 3 and 1).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 35. Minimum losses from servicing by the transport vehicle 2 of target points - 45,54 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 7/12 TP with numbers 3 and 1).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 8/12 TP with numbers 3 and 4), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 8/12 TP with numbers 3 and 4).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 25. Minimum losses from servicing by the transport vehicle 2 of target points - 23,69 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 8/12 TP with numbers 3 and 4).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 9/12 TP with numbers 3 and 5), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 9/12 TP with numbers 3 and 5).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 25. Minimum losses from servicing by the transport vehicle 2 of target points - 24,17 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 9/12 TP with numbers 3 and 5).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 10/12 TP with numbers 4 and 1), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 10/12 TP with numbers 4 and 1).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 35. Minimum losses from servicing by the transport vehicle 2 of target points - 38,69 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 10/12 TP with numbers 4 and 1).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 11/12 TP with numbers 4 and 3), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 11/12 TP with numbers 4 and 3).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 30. Minimum losses from servicing by the transport vehicle 2 of target points - 28,69 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 11/12 TP with numbers 4 and 3).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 12/12 TP with numbers 4 and 5), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 12/12 TP with numbers 4 and 5).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 25. Minimum losses from servicing by the transport vehicle 2 of target points - 20,06 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 12/12 TP with numbers 4 and 5).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 2 of solving the task, number of which equals 22.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 2 of solving the task.
4. It is the end of numerical optimization (a stage 2 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 5. Minimum losses from servicing by the transport vehicle 5 of target points - 108,14 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 2 of solving the task.
-----------------------------------------------------------------------------
6. It is the end of a final stage of solving the task "0000_to_00000.EEEE13", consisting in forming the output data file.
-----------------------------------------------------------------------------
> Duration of solving the task "0000_to_00000.EEEE13" - 0:00:00.
===================================================

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////

